Prefix codes, trees and automata
نویسنده
چکیده
We inv~stigate-the relations be'·"'h.",pn the tree representation of a prefix code C, its patterns, the minimal automaton ~ * whi.ch recognizes C and the homomorphic images of the underlying algebra of ::G'. These relations provide us with an appealing formulation which allows us to state (and eventually solve) some problems concerning the structure of prefix codes and therefore the structure of trees • .
منابع مشابه
Prefix function view of states and events
Prefix functions are thought as a unifying concept for different ways of looking at discrete processes. The idea of prefix function consists in establishing relations between events and states; different types of such relations correspond to different ways of understanding states being reached in the course of computation. This concept covers such concurrent systems description tools as finite ...
متن کاملIndecomposable prefix codes and prime trees
In this paper we introduce a notion of divisibility and primality on k-ary trees and we nd a relation between indecomposable preex code and prime trees. This relation allows to work on trees instead than directly on preex codes. In this way we can prove a density theorem for indecomposable preex codes and we can give an algorithm to test the indecomposability of a maximal preex code.
متن کاملRecurrent sets
A recurrent set of words is such that its minimal automaton is strongly connected. This class of sets does not seem to have been studied before. It contains the submonoids generated by prefix codes but also more general sets. We prove some properties of recurrent sets and investigate their relation with a natural generalization of prefix codes called weakly prefix codes, and also known as codes...
متن کاملSparse and Truncated Suffix Trees on Variable-Length Codes
The sparse suffix trees (SST), introduced by (Kärkkäinen and Ukkonen, COCOON 1996), is the suffix tree for a subset of all suffixes of an input text T of length n. In this paper, we study a special case that an input string is a sequence of codewords drawn from a regular prefix code ∆ ⊆ Σ recognized by a finite automaton, and index points locate on the code boundaries. In this case, we present ...
متن کاملIsomorphism of Regular Trees and Words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a regular language. In case regular languages are represented by NFAs (DFAs), the isomorphism problem for regular trees turns out to be EXPTIME-complete (resp. P-complete). In case the input automata are acyclic NFAs (acy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 8 شماره
صفحات -
تاریخ انتشار 1975